منابع مشابه
The Cryptographic Abstract Machine
The Cryptographic Abstract Machine is an executional model of cryptographic actions, independent of the concrete cryptographic procedures employed, even of the abstraction level of the underlying model of cryptography. This is motivated both by a theoretical purpose of relating the dynamics of protocol executions at different levels of abstraction, and by a practical purpose of enabling automat...
متن کاملA Rewrite Stack Machine for Roc! a Rewrite Stack Machine for Roc! *
ROC! is a deterministic rewrite strategy language which includes the rewrite rulesas basic operators, and the deterministic choice and the repetition as high-level strategyoperators. In this paper we present a method which, for a given term rewriting system(TRS) R, constructs a new TRS R such that R-rewriting is equivalent (sound and com-plete) with R-rewriting constrained by RO...
متن کاملZ and Abstract Machine Notation: A Comparison
In this paper we compare the formal specification languages Z and Abstract Machine Notation (AMN); the latter of which is due to Abrial. The strategy adopted is that of presenting the same specification both in Z and AMN and of commenting on salient differences as they arise. The specification chosen is a slightly revised version of the specification of an Internal Telephone Number Database fou...
متن کاملAugmenting a Stack-based Virtual Machine with One-address Instructions for Performance Enhancement
This work proposed a performance improvement of a stack-based virtual mchine by augmenting the instruction set with one-address instructions. The extended instructions are binary operators with two addressing modes: access local variables and immediate mode. An experiment is carried out to measure the effectiveness of the proposal based on modification of a stack-based virtual machine to includ...
متن کاملTuring Impossibility Properties for Stack Machine Programming
The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised about the Turing impossibility properties concerning different method interfaces for stack machine programming.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2018
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2018-30(3)-12